منابع مشابه
شناسایی مبتنی بر میزبان کرم واره ها در شبکه های peer-to-peer
کرم واره ها (کرم های کامپیوتری)، به علت قابلیت انتشار مستقل و اثرات مخربی که می توانند بر جای بگذارند، یکی از بزرگترین تهدیدات شبکه محسوب می گردند. روش های تشخیص کرم واره باید از سرعت بالایی برخوردار بوده، نرخ خطای پایینی داشته و قابلیت تشخیص کرم واره ها ی جدید را نیز داشته باشند. شبکه های جدیدی مانند شبکه peer-to-peer (p2p)باعث به وجود آمدن زمینه جدیدی برای فعالیت کرم واره ها شده اند. کرم واره...
15 صفحه اولWhen Multi-hop Peer-to-Peer Lookup Matters
Distributed hash tables have been around for a long time [5, 7]. A number of recent projects propose peerto-peer DHTs, based on multi-hop lookup optimizations. Some of these systems also require data permanence. This paper presents an analysis of when these optimizations are useful. We conclude that the multihop optimizations make sense only for truly vast and very dynamic peer networks. We als...
متن کاملWhen Multi-Hop Peer-to-Peer Routing Matters
Distributed hash tables have been around for a long time [1, 2]. A number of recent projects propose peer-to-peer DHTs, based on multi-hop lookup optimizations. Some of these systems also require data permanence. This paper presents an analysis of when these optimizations are useful. We conclude that the multi-hop optimizations make sense only for truly vast and very dynamic peer networks. We a...
متن کاملWhen Peer-to-Peer comes Face-to-Face: Collaborative Peer-to-Peer Computing in Mobile Ad hoc Networks
This paper motivates and describes the notion of ad hoc mobile information systems. Such a system consists of a decentralized and self-organizing network of autonomous, mobile devices that interact as peers. Connectivity is determined by distance between devices; as hosts change their physical location they establish pair-wise peering relationships based on mutual proximity. We describe applica...
متن کاملTAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Erzincan Üniversitesi Eğitim Fakültesi Dergisi
سال: 2019
ISSN: 2148-7758
DOI: 10.17556/erziefd.623469